Efficient computation of passage time densities and distributions in Markov chains using Laguerre method
نویسندگان
چکیده
The Laguerre method for the numerical inversion of Laplace transforms is a well known approach to the approximation of probability density functions (PDFs) and cumulative distribution functions (CDFs) of first passage times in Markov chains. Results are presented that relate the Laguerre generating functions and Laguerre coefficients of a PDF with those of the corresponding complementary CDF. This enables the ability to compute the PDF or CDF from the Laplace transform of either at the cost of computing only one set of Laguerre coefficients.
منابع مشابه
Aggregation and Numerical Techniques for Passage Time Calculations in Large semi-Markov Models
First-passage time densities and quantiles are important metrics in performance analysis. They are used in the analysis of mobile communication systems, web servers, manufacturing systems as well as for the analysis of the quality of service of hospitals and government organisations. In this report we look at computational techniques for the first-passage time analysis on highlevel models that ...
متن کاملMarkov chain-based numerical method for degree distributions of growing networks.
In this paper, we establish a relation between growing networks and Markov chains, and propose a computational approach for network degree distributions. Using the Barabási-Albert model as an example, we first show that the degree evolution of a node in a growing network follows a nonhomogeneous Markov chain. Exploring the special structure of these Markov chains, we develop an efficient algori...
متن کاملFirst passage time for Brownian motion and piecewise linear boundaries
We propose a new approach to calculating the first passage time densities for Brownian motion crossing piecewise linear boundaries which can be discontinuous. Using this approach we obtain explicit formulas for the first passage densities and show that they are continuously differentiable except at the break points of the boundaries. Furthermore, these formulas can be used to approximate the fi...
متن کاملar X iv : m at h - ph / 0 40 90 80 v 2 5 O ct 2 00 4 A Markov Chain - Based Numerical Method for Calculating Network Degree Distributions ∗
This paper establishes a relation between scale-free networks and Markov chains, and proposes a computation framework for degree distributions of scale-free networks. We first find that, under the BA model, the degree evolution of individual nodes in a scale-free network follows some non-homogeneous Markov chains. Exploring the special structure of these Markov chains, we are able to develop an...
متن کاملHypergraph-based Parallel Computation of Passage Time Densities in Large Semi-Markov Models
Passage time densities and quantiles are important performance and quality of service metrics, but their numerical derivation is, in general, computationally expensive. We present an iterative algorithm for the calculation of passage time densities in semi-Markov models, along with a theoretical analysis and empirical measurement of its convergence behaviour. In order to implement the algorithm...
متن کامل